Intelligent snapshot point-in-time management in object storage

ABSTRACT

An application is used, by a processor, to provide directives to a tiered data object storage environment for manipulating and managing stored data objects by using an existing policy developed by a history of directives to intelligently estimate which of the data objects are to be migrated between a higher storage tier and a lower storage tier and at what appropriate time, while refraining from migrating data objects with a pending management operation.

CROSS REFERENCE TO RELATED APPLICATIONS

This Application is a Continuation of U.S. patent application Ser. No.14/942,468, filed on Nov. 16, 2015.

BACKGROUND OF THE INVENTION

Field of the Invention

The present invention relates in general to computing systems, and moreparticularly, to various embodiments for managing data objects stored ina tiered data object storage environment.

Description of the Related Art

In today's society, computer systems are commonplace. Computer systemsmay be found in the workplace, at home, or at school. As computersystems become increasingly relied upon, convenient, and portable, theInternet has grown exponentially. Now more than ever, individuals andbusinesses rely upon distributed storage systems (commonly referred toas “the cloud”) to store information and data. As wide strides intechnological advancement relating to data access devices have beenaccomplished, there is an ever-growing demand for growth and developmentwithin the back end supporting systems that provide and store the datacontent.

SUMMARY OF THE INVENTION

Various embodiments for managing data objects stored in a tiered dataobject storage environment, by a processor device, are provided. In oneembodiment, a method comprises using an application to providedirectives to the tiered data object storage environment formanipulating and managing stored data objects by using an existingpolicy developed by a history of directives to intelligently estimatewhich of the data objects are to be migrated between a higher storagetier and a lower storage tier and at what appropriate time, whilerefraining from migrating data objects with a pending managementoperation.

In addition to the foregoing exemplary embodiment, various other systemand computer program product embodiments are provided and supply relatedadvantages. The foregoing summary has been provided to introduce aselection of concepts in a simplified form that are further describedbelow in the Detailed Description. This Summary is not intended toidentify key features or essential features of the claimed subjectmatter, nor is it intended to be used as an aid in determining the scopeof the claimed subject matter. The claimed subject matter is not limitedto implementations that solve any or all disadvantages noted in thebackground.

BRIEF DESCRIPTION OF THE DRAWINGS

In order that the advantages of the invention will be readilyunderstood, a more particular description of the invention brieflydescribed above will be rendered by reference to specific embodimentsthat are illustrated in the appended drawings. Understanding that thesedrawings depict only typical embodiments of the invention and are nottherefore to be considered to be limiting of its scope, the inventionwill be described and explained with additional specificity and detailthrough the use of the accompanying drawings, in which:

FIG. 1 illustrates a block diagram of a computer storage environment inwhich aspects of the present invention may be realized;

FIG. 2 illustrates a block diagram of a hardware structure of a datastorage system in which aspects of the present invention may berealized;

FIG. 3 illustrates a block diagram of a prior art object storageenvironment;

FIG. 4 illustrates an additional block diagram of a prior art objectstorage environment;

FIG. 5 illustrates a block diagram of an object storage environmentdepicting aspects of the present invention;

FIG. 6 illustrates a flow chart of a method for managing data objectsstored in a tiered data object storage environment; and

FIG. 7 illustrates an additional flow chart of a method for managingdata objects stored in a tiered data object storage environment.

DETAILED DESCRIPTION OF THE DRAWINGS

Described embodiments, and illustrative figures of various embodimentsfor managing data objects stored in a tiered data object storageenvironment are to follow. In the interest of clarity, not all featuresof an actual implementation are described in this Specification. It willof course be appreciated by the skilled artisan, that in the developmentof any such actual embodiment, numerous implementation-specificdecisions must be made to achieve the developers' specific goals, suchas compliance with system-related and business-related constraints,which will vary from one implementation to another. Furthermore, it willbe appreciated that such a development effort may be complex andlabor-intensive, but would nevertheless be a routine undertaking forthose of ordinary skill in the art having the benefit of thisDisclosure.

Various methods exist for creating data redundancy. For example, afunction such as a flashcopy function enables an administrator to makepoint-in-time, full volume copies of data, with the copies immediatelyavailable for read or write access. The flashcopy can be used withstandard backup tools that are available in the environment to createbackup copies on tape. A flashcopy function creates a copy of a sourcevolume on a target volume. This copy, as mentioned above, is called apoint-in-time copy. When a flashcopy operation is initiated, arelationship is created between a source volume and target volume. Thisrelationship is a “mapping” of the source volume and the target volume.This mapping allows a point-in-time copy of that source volume to becopied to the associated target volume. The relationship exists betweenthis volume pair from the time that the flashcopy operation is initiateduntil the storage unit copies all data from the source volume to thetarget volume, or the relationship is deleted.

When the data is physically copied, a background process copies tracksfrom the source volume to the target volume. The amount of time that ittakes to complete the background copy depends on various criteria, suchas the amount of data being copied, the number of background copyprocesses that are running and any other activities that are presentlyoccurring. The flashcopy function works in that the data which is beingcopied does not actually need to be copied instantaneously, it onlyneeds to be copied just prior to an update causing on overwrite of anyold data on the source volume. So, as data changes on the source volume,the original data is copied to the target volume before beingoverwritten on the source volume.

Therefore, a flashcopy is a feature supported on various storage devicesthat allows a user or an automated process to make nearly instantaneouscopies of entire logical volumes of data. A copy of a source disk ismade on a target disk. The copies are immediately available for bothread and write access. A common feature of flashcopy likeimplementations is the ability to reverse the copy. That is, to populatethe source disk of a flashcopy map with the contents of the target disk.It is also possible to use flashcopy in cascaded implementations, inwhich a target disk later becomes the source disk for a furtherflashcopy or vice versa.

A cascaded configuration of storage volumes is described in detail inU.S. Pat. No. 7,386,695. It is also possible to create multiple cascadesof storage volumes which are interlocking at a logical level. A firstcascade may comprise storage volumes A, B, C and D which are arranged ina cascade as follows: A⇄B⇄C⇄D, while at a later time a new backup of Amay be started that ultimately leads to the creation of A⇄E⇄F. Manydifferent combinations of flashcopy functions and reversed functions arepossible, potentially creating complicated multiple cascading storagevolumes.

A typical use case for multiple target flashcopy is to create a numberof application consistent snapshots of a production disk (the sourcevolume of the flashcopies). This is done using some form of aconsistency group in order to guarantee that all the copies areidentical.

The mechanisms illustrated below may be applicable to a variety ofnetwork topologies and network components as will be further described.Notwithstanding the illustration of some of the functionality attendantto the various embodiments, one of ordinary skill will appreciate thatthe methodologies herein may be adapted to a wide variety ofimplementations and scenarios as noted above.

Turning now to FIG. 1, a schematic pictorial illustration of a dataprocessing storage subsystem 20 is shown, in accordance with a disclosedembodiment of the invention. The particular subsystem shown in FIG. 1 ispresented to facilitate an explanation of the invention. However, as theskilled artisan will appreciate, the invention can be practiced usingother computing environments, such as other storage subsystems withdiverse architectures and capabilities.

Storage subsystem 20 receives, from one or more host computers 22,input/output (I/O) requests, which are commands to read or write data atlogical addresses on logical volumes. Any number of host computers 22are coupled to storage subsystem 20 by any means known in the art, forexample, using a network. Herein, by way of example, host computers 22and storage subsystem 20 are assumed to be coupled by a Storage AreaNetwork (SAN) 26 incorporating data connections 24 and Host Bus Adapters(HBAs) 28. The logical addresses specify a range of data blocks within alogical volume, each block herein being assumed by way of example tocontain 512 bytes. For example, a 10 KB data record used in a dataprocessing application on a given host computer 22 would require 20blocks, which the given host computer might specify as being stored at alogical address comprising blocks 1,000 through 1,019 of a logicalvolume. Storage subsystem 20 may operate in, or as, a SAN system.

Storage subsystem 20 comprises a clustered storage controller 34 coupledbetween SAN 26 and a private network 46 using data connections 30 and44, respectively, and incorporating adapters 32 and 42, againrespectively. In some configurations, adapters 32 and 42 may comprisehost SAN adapters (HSAs). Clustered storage controller 34 implementsclusters of storage modules 36, each of which includes an interface 38(in communication between adapters 32 and 42), and a cache 40. Eachstorage module 36 is responsible for a number of storage devices 50 byway of a data connection 48 as shown.

As described previously, each storage module 36 further comprises agiven cache 40. However, it will be appreciated that the number ofcaches 40 used in storage subsystem 20 and in conjunction with clusteredstorage controller 34 may be any convenient number. While all caches 40in storage subsystem 20 may operate in substantially the same manner andcomprise substantially similar elements, this is not a requirement. Eachof the caches 40 may be approximately equal in size and is assumed to becoupled, by way of example, in a one-to-one correspondence with a set ofphysical storage devices 50, which may comprise disks. In oneembodiment, physical storage devices may comprise such disks. Thoseskilled in the art will be able to adapt the description herein tocaches of different sizes.

Each set of storage devices 50 comprises multiple slow and/or fastaccess time mass storage devices, herein below assumed to be multiplehard disks. FIG. 1 shows caches 40 coupled to respective sets of storagedevices 50. In some configurations, the sets of storage devices 50comprise one or more hard disks, which can have different performancecharacteristics. In response to an I/O command, a given cache 40, by wayof example, may read or write data at addressable physical locations ofa given storage device 50. In the embodiment shown in FIG. 1, caches 40are able to exercise certain control functions over storage devices 50.These control functions may alternatively be realized by hardwaredevices such as disk controllers (not shown), which are linked to caches40.

Each storage module 36 is operative to monitor its state, including thestates of associated caches 40, and to transmit configurationinformation to other components of storage subsystem 20 for example,configuration changes that result in blocking intervals, or limit therate at which I/O requests for the sets of physical storage areaccepted.

Routing of commands and data from HBAs 28 to clustered storagecontroller 34 and to each cache 40 may be performed over a networkand/or a switch. Herein, by way of example, HBAs 28 may be coupled tostorage modules 36 by at least one switch (not shown) of SAN 26, whichcan be of any known type having a digital cross-connect function.Additionally, or alternatively, HBAs 28 may be coupled to storagemodules 36.

In some embodiments, data having contiguous logical addresses can bedistributed among modules 36, and within the storage devices in each ofthe modules. Alternatively, the data can be distributed using otheralgorithms, e.g., byte or block interleaving. In general, this increasesbandwidth, for instance, by allowing a volume in a SAN or a file innetwork attached storage to be read from or written to more than onegiven storage device 50 at a time. However, this technique requirescoordination among the various storage devices, and in practice mayrequire complex provisions for any failure of the storage devices, and astrategy for dealing with error checking information, e.g., a techniquefor storing parity information relating to distributed data. Indeed,when logical unit partitions are distributed in sufficiently smallgranularity, data associated with a single logical unit may span all ofthe storage devices 50.

While not explicitly shown for purposes of illustrative simplicity, theskilled artisan will appreciate that in some embodiments, clusteredstorage controller 34 may be adapted for implementation in conjunctionwith certain hardware, such as a rack mount system, a midplane, and/or abackplane. Indeed, private network 46 in one embodiment may beimplemented using a backplane. Additional hardware such as theaforementioned switches, processors, controllers, memory devices, andthe like may also be incorporated into clustered storage controller 34and elsewhere within storage subsystem 20, again as the skilled artisanwill appreciate. Further, a variety of software components, operatingsystems, firmware, and the like may be integrated into one storagesubsystem 20.

FIG. 2 is a schematic pictorial illustration of facility 60 configuredto perform host computer monitoring, in accordance with an embodiment ofthe present invention. In the description herein, host computers 22,storage controllers 34 and their respective components may bedifferentiated by appending a letter to the identifying numeral, so thatfacility 60 comprises a first host computer 22A (also referred to hereinas a primary host computer) coupled to a clustered storage controller34A via a SAN 26A, and a second host computer 22B (also referred toherein as a secondary host computer) coupled to a clustered storagecontroller 34B via a SAN 26B. In the configuration shown in FIG. 2storage controllers 34A and 34B are coupled via a facility SAN 62.

Host computer 22A comprises a processor 64A, a memory 66A, and anadapter 68A. Adapter 68A is coupled to SAN 26A via a data connection24A.

As described supra, module 36A is coupled to storage devices 50A viadata connections 48A, and comprises adapters 32A and 42A, a cache 40A,and an interface 38A. Module 36A also comprises a processor 70A and amemory 72A. As explained in detail hereinbelow, processor 70A isconfigured to establish metrics 74 that indicate a connectivity statusof host computer 22A, and store the metrics to memory 72A. In someembodiments, processor 70A may store metrics 74 to storage devices 50A.

Host computer 22B comprises a processor 64B, a memory 66B, and anadapter 68B. Adapter 68B is coupled to SAN 26B via a data connection24B.

As described supra, module 36B is coupled to storage devices 50B viadata connections 48B, and comprises adapters 32B and 42B, a cache 40B,and an interface 38B. Module 36B also comprises a processor 70A and amemory 72B.

Processors 64A, 64B, 70A and 70B typically comprise general-purposecomputers, which are programmed in software to carry out the functionsdescribed herein. The software may be downloaded to host computers 22Aand 22B and modules 36A and 36B in electronic form, over a network, forexample, or it may be provided on non-transitory tangible media, such asoptical, magnetic or electronic memory media. Alternatively, some or allof the functions of the processors may be carried out by dedicated orprogrammable digital hardware components, or using a combination ofhardware and software elements.

Examples of adapters 32A, 32B, 42A, 42B, 68A and 68B, include switchedfabric adapters such as Fibre Channel (FC) adapters, Internet SmallComputer System Interface (iSCSI) adapters, Fibre Channel over Ethernet(FCoE) adapters and Infiniband™ adapters.

While the configuration shown in FIGS. 2 shows storage host computers22A and 22B coupled to storage controllers 34A and 34B via SANs 26A and26B, other configurations are to be considered within the spirit andscope of the present invention. For example, host computers 22A and 22Bcan be coupled to a single storage controller 34 via a single SAN 26.

Distributed storage (i.e. cloud storage) is primarily comprised ofobject storage at massive scale. Object storage provides very littlecontrol over manipulating point-in-time snapshot copies of datagenerated by storage subsystems such as Spectrum Virtualize™(Storwize™), IBM DS8000™, Spectrum Accelerate™ (XiV™) Netapp™, etc. Forexample, object storage offers simple Representational State Transfer(REST) Application Programming Interface (API) commands such as GET,PUT, and DELETE.

In the case of backup/restore and copy data management, a storagecontroller such as Spectrum Virtualize™ (Storwize V7000™) may generatean initial full backup followed by several incremental backups and pushthem to the object storage. The backups may be controlled via a policysuch that a backup is taken every few hours (e.g. 4 hours). Over time,the amount of backup points-in-time stored in the environment growstremendously and it is unnecessary to keep multiple point-in-time copiesof data at these intervals once the points-in-time are have aged morethan a week old (as an example). In order to save space, there is a needto merge/collapse point-in-time backups in the object storage accordingto a user defined policy. No interface currently exists to perform theseoperations within object storage.

There may be the need to update the point-in-time of the full copy inthe object storage in order to improve efficiency in the event of adisaster recovery operation. The most likely scenario during a disasterrecovery is to recover data from the point-in-time nearest toproduction. In order to recover from a disaster, it is necessary torestore a full volume from the object storage and then apply restorepoints from incremental backups repetitively until the desiredpoint-in-time is achieved. If a substantial amount of time has passedsince the initial full backup was obtained, it would mean performingmany incremental restore operations from the object storage afterperforming the full restore.

Additionally, a user may request to delete point-in-time snapshots fromthe object storage. In order to maintain the ability to restore from anypoint-in-time from the object storage, a flashcopy bitmap cascade mustbe preserved. Deleting flashcopy bitmaps in the middle of the data chainfrom the object storage inevitably breaks the data chain.

The object storage target that stores the snapshot backups as objectsand that also supports the above commands and operations (collapse, movefull forward, delete, etc.) may have a low cost storage tier associatedwith it which has much different performance characteristics.

FIG. 3 illustrates a block diagram 300 of a prior art object storageenvironment relating to that discussed above. Diagram 300 illustrates anexample background environment for understanding the mechanisms of thepresent invention and shows cascaded full and incremental flashcopy datastored between multiple storage tiers. Illustrated is a productionenvironment 302, object storage provided in a higher (warm/disk) tier304, and object storage provided in a lower (cold/tape) tier 306. In theproduction environment 302 is a production vdisk 308, and each flashcopypoint-in time contains one or more target volumes, namely T0 Tgt Disk316 in the lower tier 306, T1 Tgt Disk 314 and T2 Tgt Disk 312 in thehigher tier 304, and T3 Tgt Disk 310 in the production environment 302.Each flashcopy point-in-time also contains one or more flashcopy maps(fcmap).

The underlying problem is that point-in-time management operations mayneed to access data from the lower tier, which causes unnecessaryoverhead in the object storage. Further these management operations mayinterfere with customer initiated commands (e.g. GET commands) from thetop end of the object store which translates to having to recall datafrom the lower tier.

FIG. 4 illustrates this issue in a scenario of moving the full objectforward to point-in-time T2 while a user initiates a GET command for adifferent object in the cold tier. FIG. 4 illustrates this scenario in ablock diagram 400. Illustrated is the production environment 302, theobject storage provided in a higher (warm/disk) tier 304, and the objectstorage provided in a lower (cold/tape) tier 306. In the productionenvironment 302 is the production vdisk 308, and each flashcopy point-intime contains one or more of the target volumes, namely T0 Tgt Disk 316in the lower tier 306, T1 Tgt Disk 314 and T2 Tgt Disk 312 in the highertier 304, and T3 Tgt Disk 310 in the production environment 302. Eachflashcopy point-in-time also contains the one or more flashcopy maps(fcmap).

Diagram 400 illustrates a move full forward operation 402A frompoint-in-time T0 Tgt Disk 316 to point-in-time T2 Tgt Disk 312 forproduction vdisk A 404. This results in a recall of T0 Tgt Disk 316 fromthe object storage. In parallel, a GET command operation 402B is issuedfor T0 Tgt Disk 316 for production vdisk B 406. This operation isblocked since the lower tier is already performing a recall for the movefull forward command in operation.

Accordingly, the mechanisms of the present invention prevent unnecessaryrecalls from the lower tier in the object store from taking place when amanagement operation is pending, such as performing a delete, move fullforward, prune, and collapse of point-in-time copies of productionvolumes mapped to objects. Further, these mechanisms also preventwriting data to tape only to have it deleted a short time later. Thesefeatures are employed by adding intelligence in the overall system toensure that data objects are not migrated to a lower tier (e.g. tape) ifthey have the pending management operation associated with them.

The mechanisms of the present invention enable applications such asStorwize™ and MCStore™ to provide directives to the object storageservice pertaining to the management of full and incremental flashcopypoints-in-time stored within the environment. The storage serviceprovider will interpret these directives in order to perform functionssuch as: collapse points-in-time, move the full backup forward in time,delete points-in-time, reconcile points-in-time, update directives, andprovide status on operations.

In one embodiment, the application may set directives to the objectstorage providing guidance with respect to the time to migrate specificobjects to the lower (tape) tier. These directives are tightlyintegrated with point-in-time management operations to ensure that datais not unnecessarily recalled from tape.

FIG. 5 illustrates a block diagram 500 providing an example of theaforementioned. For example, in the aforementioned case of moving thedata object full forward from point-in-time T0 Tgt Disk 316 topoint-in-time T2 Tgt Disk 312 for production vdisk 308, the applicationmay send a directive to the object store indicating that point-in-timeobjects T0 Tgt Disk 316, T1 Tgt Disk 314, and T2 Tgt Disk 312 should notbe moved to the lower tier 306. Further upon invocation of themanagement operation to move the full forward operation, the applicationmay instruct the object storage to move objects to the lower tier 306,delete objects, etc., after the management operation completes.

Continuing to FIG. 6, a method 600 for managing data objects stored in atiered data object storage environment is illustrated, in accordancewith one embodiment of the present invention. Starting at step 602, anapplication is used to provide directives to the tiered data objectstorage environment for manipulating and managing stored data objectssuch that data objects with a pending management operation are refrainedfrom being migrated from a higher storage tier to a lower storage tier(step 604). The method ends (step 606).

Under the mechanisms illustrated herein, the tagging of data objects tokeep them in the higher (warm) tier may be performed using a variety ofmethods between the application and the object storage service. Examplesof these methods include, but are not limited to, a REST API, anextensible markup language (XML) document, and/or a separate socketinterface.

In one embodiment, using the example of a REST API, the application mayprovide a new API command for the data object store to interpret thatcontrols the management of placing data on the lower tier which iscoordinated with the point-in-time management tasks. Additionally, oralternatively, the API may set extended attributes in each data objectwhich provides instructions that the object store extracts andinterprets. The application may also be able to query the location of adata object (determining whether on a lower tape tier or higher disktier), as well as the status of in progress management operations.

In case of unexpected placement of data on lower storage tiers in theobject store, the application may instruct the object store to prefetchthe appropriate data from the lower tier ahead of the operation in orderto streamline production. Further in the case of error recovery, such asa situation where the production environment becomes disconnected fromthe object store for an extended period of time such that the objectstore does not receive any directives, an existing policy and/or historyoperations may be used to make an intelligent estimation about whichdata objects should be migrated between storage tiers, and at what time.

Additionally, if such were the case where data is inadvertently migratedto a lower tier and a point-in-time management operation needs to takeplace, the data objects associated with flashcopy bitmaps may be left onthe higher tier such that the bitmaps may be manipulated to point atdifferent objects on the lower tier without having to recall and rewritethe tape on the lower tier. In this model, old data is simply marked fordelete or overwrite, however may recall some lower tier levelreconciliation at a time in the future.

The coordination and intelligence of the application to correlatepoint-in-time management operations with the optimal placement of datain the appropriate object storage tier, and more specifically itsability to be aware of production in a lower tier in an object store,along with the object store's ability to take the appropriate actionbased on the instruction of the application, provides an optimal end toend solution.

FIG. 7 illustrates a flow chart of a method 700 for managing dataobjects stored in a tiered data object storage environment, reviewingthe aforementioned features of the present invention. Beginning at step702, an application provides directives to an object store regardingstored point-in-time data objects (step 704). The directives arecommunicated to the object storage system through the object storageservice provider using the aforementioned techniques (step 706). Thedirectives provide commands for handling the migration of objectsbetween storage tiers and the coordination of point-in-time objects(step 708). Finally, the object storage system uses the directives tointelligently handle the migration operations of the data objects withinthe tiered storage environment (step 710). The method ends (step 712).

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

While one or more embodiments of the present invention have beenillustrated in detail, the skilled artisan will appreciate thatmodifications and adaptations to those embodiments may be made withoutdeparting from the scope of the present invention as set forth in thefollowing claims.

1. A method for managing data objects stored in a tiered data objectstorage environment, by a processor device, comprising: using anapplication to provide directives to the tiered data object storageenvironment for manipulating and managing stored data objects by usingan existing policy developed by a history of directives to intelligentlyestimate which of the data objects are to be migrated between a higherstorage tier and a lower storage tier and at what appropriate time,while refraining from migrating data objects with a pending managementoperation.
 2. The method of claim 1, wherein the management operationcomprises a function relating to the management of stored full andincremental point-in-time copy data, and the tiered data object storageenvironment is operated by a storage service provider.
 3. The method ofclaim 2, further including providing directives, by the application, byperforming one of: tagging the data objects with the pending managementoperation by providing a command interpreted by the tiered data objectstorage environment; and setting extended attributes in the data objectsproviding management instructions interpreted by the tiered data objectstorage environment.
 4. The method of claim 1, further includingquerying, by the application, a location of the data objects including astatus of the pending management operation; and prefetching the dataobjects from the lower storage tier to the higher storage tier tostreamline the pending management operation.
 5. The method of claim 1,further including, for data objects stored in the lower storage tierwith the pending management operation, pointing from data objectsassociated with a point-in-time copy bitmap on the higher storage tierto existing data objects stored in the lower storage tier.
 6. The methodof claim 3, wherein the application provides the directives to thestorage service provider using one of an application programminginterface (API), an extensible markup language (XML) document, and aseparate socket interface.
 7. A system for managing data objects storedin a tiered data object storage environment, the system comprising: atiered data storage environment comprising a plurality of storagevolumes; an application in communication with the tiered data storageenvironment; and at least one processor device, wherein the processordevice: uses an application to provide directives to the tiered dataobject storage environment for manipulating and managing stored dataobjects by using an existing policy developed by a history of directivesto intelligently estimate which of the data objects are to be migratedbetween a higher storage tier and a lower storage tier and at whatappropriate time, while refraining from migrating data objects with apending management operation.
 8. The system of claim 7, wherein themanagement operation comprises a function relating to the management ofstored full and incremental point-in-time copy data, and the tiered dataobject storage environment is operated by a storage service provider. 9.The system of claim 8, wherein the at least one processor deviceprovides directives, by the application, by performing one of: taggingthe data objects with the pending management operation by providing acommand interpreted by the tiered data object storage environment; andsetting extended attributes in the data objects providing managementinstructions interpreted by the tiered data object storage environment.10. The system of claim 7, wherein the at least one processor devicequeries, by the application, a location of the data objects including astatus of the pending management operation; and prefetches the dataobjects from the lower storage tier to the higher storage tier tostreamline the pending management operation.
 11. The system of claim 7,wherein the at least one processor device, for data objects stored inthe lower storage tier with the pending management operation, pointsfrom data objects associated with a point-in-time copy bitmap on thehigher storage tier to existing data objects stored in the lower storagetier.
 12. The system of claim 9, wherein the application provides thedirectives to the storage service provider using one of an applicationprogramming interface (API), an extensible markup language (XML)document, and a separate socket interface.
 13. A computer programproduct for managing data objects stored in a tiered data object storageenvironment, by a processor device, the computer program productembodied on a non-transitory computer-readable storage medium havingcomputer-readable program code portions stored therein, thecomputer-readable program code portions comprising: an executableportion that uses an application to provide directives to the tiereddata object storage environment for manipulating and managing storeddata objects by using an existing policy developed by a history ofdirectives to intelligently estimate which of the data objects are to bemigrated between a higher storage tier and a lower storage tier and atwhat appropriate time, while refraining from migrating data objects witha pending management operation.
 14. The computer program product ofclaim 13, wherein the management operation comprises a function relatingto the management of stored full and incremental point-in-time copydata, and the tiered data object storage environment is operated by astorage service provider.
 15. The computer program product of claim 14,further including an executable portion that provides directives, by theapplication, by performing one of: tagging the data objects with thepending management operation by providing a command interpreted by thetiered data object storage environment; and setting extended attributesin the data objects providing management instructions interpreted by thetiered data object storage environment.
 16. The computer program productof claim 13, further including an executable portion that queries, bythe application, a location of the data objects including a status ofthe pending management operation; and an executable portion thatprefetches the data objects from the lower storage tier to the higherstorage tier to streamline the pending management operation.
 17. Thecomputer program product of claim 13, further including an executableportion that, for data objects stored in the lower storage tier with thepending management operation, points from data objects associated with apoint-in-time copy bitmap on the higher storage tier to existing dataobjects stored in the lower storage tier.
 18. The computer programproduct of claim 15, wherein the application provides the directives tothe storage service provider using one of an application programminginterface (API), an extensible markup language (XML) document, and aseparate socket interface.